Effective Load Balancing in Overlay Chord & P Grid Networks
نویسندگان
چکیده
In structured chord & P Grid systems finding the successor nodes, Load balancing and dynamic routing are the challenging issues because nodes are heterogeneous and dynamically nodes may join the network or old node may release from network. We present a general framework, HiGLOB, for global load balancing in structured Chord systems. Current load balancing, finding optimized node and dynamic routing algorithms are based on their own mechanisms they typically adhoc, heuristic based, and localized. Each node in HiGLOB has three key components: 1) A Histogram manager maintains a histogram that reflects a global view of the distribution of the load in the system 2) A Replication Load Balancing manager redistributes the load whenever the node becomes overloaded or underloaded. 3) A Routing Manager finds the best configured and optimized node and also finds the way how nodes are selected to overlay routing tables. We implement this mainly for Chord networks demonstration. KeywordsHistogram, peer-peer networks, Chord networks, overlay networks, P Grid networks, DHT
منابع مشابه
Exploiting network proximity in peer-to-peer overlay networks
Generic peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the und...
متن کاملOptimal Load Balancing in Publish/Subscribe Broker Networks
Load balancing in publish/subscribe (pub/sub) broker networks is challenging as the workload is multi-dimensional and content-dependent. In this paper we present the framework design of a middleware , called Shuffle, to achieve optimal load balancing in a pub/sub broker network. Shuffle features a suite of active workload management schemes within a single overlay topology on message parsing, m...
متن کاملLSH At Large - Distributed KNN Search in High Dimensions
We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay network. To minimize network traffic, we process queries in an incremental top-K fashion leveraging on a locality preserving mapping to the pee...
متن کاملTopology-Aware Routing in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. They provide efficient and fault-tolerant routing, object location and load balancing within a selforganizing overlay network. One important aspect of these systems is how they exploit network proximity in the underlying...
متن کاملKEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation of keywords at document level, which consumes a huge amount of storage and bandwidth cost. In this paper, we present KEYNOTE, a novel keyword search system that performs the join operation at node level. Compared to th...
متن کامل